Techniques for the Transformation of Logic Equations

A generalized DeMorgan's theorem is presented that can be applied to Boolean equations with any number of complementations. The known form of the DeMorgan's theorem is a special case of the generalized theorem with one inversion. This new theorem simplifies and generalizes the transformation of Boolean functions to their equivalent sum of product forms. Two theorems are presented that simplify and generalize the transformation of basic logic equations to NAND and to NOR forms. The NAND and NOR forms can be translated directly into the corresponding schematics for the circuit.